Optional and Iterated Types for Pregroup Grammars
نویسندگان
چکیده
Pregroup grammars are a context-free grammar formalism which may be used to describe the syntax of natural languages. However, this formalism is not able to naturally define types corresponding to optional and iterated arguments such as optional complements of verbs or verbs’ adverbial modifiers. This paper introduces two constructions that make up for this deficiency.
منابع مشابه
Fully Lexicalized Pregroup Grammars
Pregroup grammars are a context-free grammar formalism introduced as a simplification of Lambek calculus. This formalism is interesting for several reasons: the syntactical properties of words are specified by a set of types like the other type-based grammar formalisms ; as a logical model, compositionality is easy ; a polytime parsing algorithm exists. However, this formalism is not completely...
متن کاملD.Béchet A.Foret
This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...
متن کاملA Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalisms like Lambek calculus but have a polynomial parsing algorithm. The paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approch based on majority partial composition.
متن کاملLearnability of Pregroup Grammars
This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...
متن کاملPregroup Grammars and Context-free Grammars
Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008